Multiple covering of a closed set on a plane with non-Euclidean metrics

A set-covering formulation for a drayage problem with single and double container loads

This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can be efficiently solved to optimality b...

Deformable Model with Non-euclidean Metrics

Deformable models like snakes are a classical tool for image segmentation. Highly deformable models extend them with the ability to handle dynamic topological changes, and therefore to extract arbitrary complex shapes. However, the resolution of these models largely depends on the resolution of the image. As a consequence, their time and memory complexity increases at least as fast as the size ...

Simultaneous packing and covering in the Euclidean plane II

In 1950, C.A. Rogers introduced and studied the simultaneous packing and covering constants for a convex body and obtained the first general upper bound. Afterwards, they have attracted the interests of many authors such as L. Fejes Tóth, S.S. Rys̆kov, G.L. Butler, K. Böröczky, H. Horváth, J. Linhart and M. Henk since, besides their own geometric significance, they are closely related to the pac...

Cofiniteness of Local Cohomlogy Based on a Non–Closed Support Defined by a Pair of Ideals

A Local Branching Approach for the Set Covering Problem

The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...